Michał Pilipczuk: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs

Pilipczuk, Michał, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2018

Language:

english

File:

PDF, 756 KB

english, 2018

2

Below All Subsets for Minimal Connected Dominating Set

Lokshtanov, Daniel, Pilipczuk, Michał, Saurabh, Saket

Journal:

SIAM Journal on Discrete Mathematics

Year:

2018

Language:

english

File:

PDF, 359 KB

english, 2018

3

Tight Lower Bounds for the Complexity of Multicoloring

Bonamy, Marthe, Kowalik, łUkasz, Pilipczuk, Michał, Socała, Arkadiusz, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2019

Language:

english

File:

PDF, 454 KB

english, 2019

4

Tight Lower Bounds for the Complexity of Multicoloring

Bonamy, Marthe, Kowalik, łUkasz, Pilipczuk, Michał, Socała, Arkadiusz, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2019

File:

PDF, 454 KB

2019

5

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

Year:

2012

Language:

english

File:

PDF, 639 KB

english, 2012

6

Dominating set is fixed parameter tractable in claw-free graphs

Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Theoretical Computer Science

Year:

2011

Language:

english

File:

PDF, 450 KB

english, 2011

7

Kernelization hardness of connectivity problems in -degenerate graphs

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 296 KB

english, 2012

8

A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

SIAM Journal on Computing

Year:

2012

Language:

english

File:

PDF, 261 KB

english, 2012

9

Some results on Vizing’s conjecture and related problems

Marcin Pilipczuk, Michał Pilipczuk, Riste Škrekovski

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 238 KB

english, 2012

10

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2n

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Year:

2014

Language:

english

File:

PDF, 517 KB

english, 2014

11

On Cutwidth Parameterized by Vertex Cover

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk…

Journal:

Year:

2014

Language:

english

File:

PDF, 537 KB

english, 2014

12

Parameterized Complexity of Eulerian Deletion Problems

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk…

Journal:

Year:

2014

Language:

english

File:

PDF, 694 KB

english, 2014

13

Scheduling Partially Ordered Jobs Faster than 2n

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Year:

2014

Language:

english

File:

PDF, 803 KB

english, 2014

14

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters

Fomin, Fedor V., Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał, Villanger, Yngve

Journal:

Journal of Computer and System Sciences

Year:

2014

Language:

english

File:

PDF, 1.08 MB

english, 2014

15

Preprocessing subgraph and minor problems: When does a small vertex cover help?

Fomin, Fedor V., Jansen, Bart M.P., Pilipczuk, Michał

Journal:

Journal of Computer and System Sciences

Year:

2014

Language:

english

File:

PDF, 609 KB

english, 2014

16

Modifying a Graph Using Vertex Elimination

Golovach, Petr A., Heggernes, Pinar, van ’t Hof, Pim, Manne, Fredrik, Paulusma, Daniël, Pilipczuk, Michał

Journal:

Year:

2015

Language:

english

File:

PDF, 911 KB

english, 2015

17

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - An O(c^k n) 5-Approximation Algorithm for Treewidth

Bodlaender, Hans L., Drange, Pal Gronas, Dregi, Markus S., Fomin, Fedor V., Lokshtanov, Daniel, Pilipczuk, Michal

Year:

2013

Language:

english

File:

PDF, 271 KB

english, 2013

18

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable

Cygan, Marek, Marx, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal

Year:

2013

Language:

english

File:

PDF, 586 KB

english, 2013

19

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

Cygan, Marek, Nederlof, Jesper, Pilipczuk, Marcin, Pilipczuk, Michal, Rooij, Joham M.M. van, Wojtaszczyk, Jakub Onufry

Year:

2011

Language:

english

File:

PDF, 642 KB

english, 2011

20

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Designing FPT Algorithms for Cut Problems Using Randomized Contractions

Chitnis, Rajesh, Cygan, Marek, Hajiaghayi, MohammadTaghi, Pilipczuk, Marcin, Pilipczuk, Michal

Year:

2012

Language:

english

File:

PDF, 258 KB

english, 2012

21

Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

SIAM Journal on Discrete Mathematics

Year:

2013

Language:

english

File:

PDF, 265 KB

english, 2013

22

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs

Pilipczuk, Marcin, Pilipczuk, Michal, Sankowski, Piotr, Leeuwen, Erik Jan van

Year:

2014

Language:

english

File:

PDF, 362 KB

english, 2014

23

On Group Feedback Vertex Set Parameterized by the Size of the Cutset

Cygan, Marek, Marcin Pilipczuk,, Michał Pilipczuk,

Journal:

Year:

2016

Language:

english

File:

PDF, 212 KB

english, 2016

24

Sitting Closer to Friends than Enemies, Revisited

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

Theory of Computing Systems

Year:

2015

Language:

english

File:

PDF, 420 KB

english, 2015

25

Minimizing Rosenthal Potential in Multicast Games

Fomin, Fedor V., Golovach, Petr A., Nederlof, Jesper, Pilipczuk, Michał

Journal:

Theory of Computing Systems

Year:

2015

Language:

english

File:

PDF, 671 KB

english, 2015

26

Computing Tree-Depth Faster Than\(2^{n}\)

Fomin, Fedor V., Giannopoulou, Archontia C., Pilipczuk, Michał

Journal:

Year:

2015

Language:

english

File:

PDF, 291 KB

english, 2015

27

Parameterized Algorithms ||

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 7.88 MB

english, 2015

28

Clique Cover and Graph Separation

Cygan, Marek, Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał, Wahlström, Magnus

Journal:

ACM Transactions on Computation Theory

Year:

2014

Language:

english

File:

PDF, 246 KB

english, 2014

29

On multiway cut parameterized above lower bounds

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

ACM Transactions on Computation Theory

Year:

2013

Language:

english

File:

PDF, 117 KB

english, 2013

30

Parameterized Algorithms || Iterative Compression

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 604 KB

english, 2015

31

Parameterized Algorithms || Matroids

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 718 KB

english, 2015

32

Parameterized Algorithms || Introduction

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 506 KB

english, 2015

33

Parameterized Algorithms || Kernelization

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 612 KB

english, 2015

34

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs

Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, MichaŁ, Wahlström, Magnus

Journal:

SIAM Journal on Discrete Mathematics

Year:

2015

Language:

english

File:

PDF, 485 KB

english, 2015

35

How to hunt an invisible rabbit on a graph

Abramovskaya, Tatjana V., Fomin, Fedor V., Golovach, Petr A., Pilipczuk, Michał

Journal:

European Journal of Combinatorics

Year:

2016

Language:

english

File:

PDF, 527 KB

english, 2016

36

A Subexponential Parameterized Algorithm for Proper Interval Completion

Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Marcin, Pilipczuk, Michał

Journal:

SIAM Journal on Discrete Mathematics

Year:

2015

Language:

english

File:

PDF, 366 KB

english, 2015

37

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal, Saurabh, Saket

Year:

2014

Language:

english

File:

PDF, 358 KB

english, 2014

38

A $c^k n$ 5-Approximation Algorithm for Treewidth

Bodlaender, Hans L., Drange, Pål Grǿnås, Dregi, Markus S., Fomin, Fedor V., Lokshtanov, Daniel, Pilipczuk, Michał

Journal:

SIAM Journal on Computing

Year:

2016

Language:

english

File:

PDF, 654 KB

english, 2016

39

Known Algorithms for Edge Clique Cover are Probably Optimal

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał

Journal:

SIAM Journal on Computing

Year:

2016

Language:

english

File:

PDF, 321 KB

english, 2016

40

Largest Chordal and Interval Subgraphs Faster than\(2^n\)

Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Michał, Villanger, Yngve

Journal:

Year:

2016

Language:

english

File:

PDF, 746 KB

english, 2016

41

Exploring the Subexponential Complexity of Completion Problems

Drange, Pål Grønås, Fomin, Fedor V., Pilipczuk, Michał, Villanger, Yngve

Journal:

ACM Transactions on Computation Theory

Year:

2015

Language:

english

File:

PDF, 1.11 MB

english, 2015

42

Designing FPT Algorithms for Cut Problems Using Randomized Contractions

Chitnis, Rajesh, Cygan, Marek, Hajiaghayi, MohammadTaghi, Pilipczuk, Marcin, Pilipczuk, Michał

Journal:

SIAM Journal on Computing

Year:

2016

Language:

english

File:

PDF, 717 KB

english, 2016

43

[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms - Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems

Bliznets, Ivan, Cygan, Marek, Komosa, Pawel, Mach, Lukáš, Pilipczuk, Michał

Language:

english

File:

PDF, 331 KB

english

44

[ACM Press the 35th ACM SIGMOD-SIGACT-SIGAI Symposium - San Francisco, California, USA (2016.06.26-2016.07.01)] Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '16 - Schema Validation via Streaming Circuits

Murlak, Filip, Paperman, Charles, Pilipczuk, Michał

Year:

2016

Language:

english

File:

PDF, 677 KB

english, 2016

45

[ACM Press the 31st Annual ACM/IEEE Symposium - New York, NY, USA (2016.07.05-2016.07.08)] Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16 - Definability equals recognizability for graphs of bounded treewidth

Bojańczyk, Mikołaj, Pilipczuk, Michał

Year:

2016

Language:

english

File:

PDF, 3.07 MB

english, 2016

46

[IEEE 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2016.10.9-2016.10.11)] 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) - Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering

Fomin, Fedor V., Lokshtanov, Daniel, Marx, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal, Saurabh, Saket

Year:

2016

Language:

english

File:

PDF, 267 KB

english, 2016

47

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Journal:

SIAM Journal on Computing

Year:

2017

Language:

english

File:

PDF, 365 KB

english, 2017

48

Linear Kernels for Outbranching Problems in Sparse Digraphs

Bonamy, Marthe, Kowalik, Łukasz, Pilipczuk, Michał, Socała, Arkadiusz

Journal:

Year:

2016

Language:

english

File:

PDF, 731 KB

english, 2016

49

The influence of a single and chronic administration of venlafaxine on tramadol pharmacokinetics in a rabbit model

Szkutnik-Fiedler, Danuta, Grabowski, Tomasz, Balcerkiewicz, Monika, Michalak, Michał, Pilipczuk, Irina, Wyrowski, Łukasz, Urjasz, Hanna, Grześkowiak, Edmund

Journal:

Pharmacological Reports

Year:

2017

Language:

english

File:

PDF, 382 KB

english, 2017

50

Polynomial Kernelization for Removing Induced Claws and Diamonds

Marek Cygan,Marcin Pilipczuk,Michał Pilipczuk…

Journal:

Theory of Computing Systems

Year:

2017

Language:

english

File:

PDF, 619 KB

english, 2017

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски